An Application of Array Token Petri Nets to Clustering Analysis for Syntactic Patterns
نویسندگان
چکیده
H. Fernau, R. Freund and M. Holzer, Character recognition with k-head finite array automata, Advances in Pattern Recognition, Lecture Notes in Computer Science, 1998, Volume 1451, pp 282-291. H. Fernau and R. Freund, Bounded Parallelism in Array Grammars used for Character Recognition, Advances in Structural and Syntactical Pattern Recognition, Lecture Notes in Computer Science, 1996, Volume 1121, pp 40 49. Patrick Shen-Pei Wang, An Application Of Array Grammars To Clustering Analysis For Syntactic Patterns, Pattern Recognition Vol. 17, No. 4, 1984, pp. 441451. K. S. Fu, S. Y. Lu, A Clustering Procedure for Syntactic Patterns, IEEE Trans. Syst. Man and Cybernet. SMC-7, 1977, 734742 James L. Peterson, Petri Net Theory and Modeling of systems, Prentice Hall, Englewood Cliffs, N J, 1981.
منابع مشابه
Multiparty Session Nets
This paper introduces global session nets, an integration of multiparty session types (MPST) and Petri nets, for role-based choreographic specifications to verify distributed multiparty systems. The graphical representation of session nets enables more liberal combinations of branch, merge, fork and join patterns than the standard syntactic MPST. We use session net token dynamics to verify a fl...
متن کاملSoccer Goalkeeper Task Modeling and Analysis by Petri Nets
In a robotic soccer team, goalkeeper is an important challenging role, which has different characteristics from the other teammates. This paper proposes a new learning-based behavior model for a soccer goalkeeper robot by using Petri nets. The model focuses on modeling and analyzing, both qualitatively and quantitatively, for the goalkeeper role so that we have a model-based knowledge of the ta...
متن کاملUsing Interval Petri Nets and Timed Automata for Diagnosis of Discrete Event Systems (DES)
A discrete event system (DES) is a dynamic system that evolves in accordance with the abrupt occurrence, at possibly unknown irregular intervals, of physical events. Because of the special nature of these systems, different tools are currently used for their analysis, design and modeling. The main focus of this paper is the presentation of a new modeling approach of Discrete Event Systems. The ...
متن کاملDense-Timed Petri Nets: Checking Zenoness, Token liveness and Boundedness
We consider Dense-Timed Petri Nets (TPN), an extension of Petri nets in which each token is equipped with a real-valued clock and where the semantics is lazy (i.e., enabled transitions need not fire; time can pass and disable transitions). We consider the following verification problems for TPNs. (i) Zenoness: whether there exists a zeno-computation from a given marking, i.e., an infinite compu...
متن کاملA rule-based evaluation of ladder logic diagram and timed petri nets for programmable logic controllers
This paper describes an evaluation through a case study by measuring a rule-based approach, which proposed for ladder logic diagrams and Petri nets. In the beginning, programmable logic controllers were widely designed by ladder logic diagrams. When complexity and functionality of manufacturing systems increases, developing their software is becoming more difficult. Thus, Petri nets as a high l...
متن کامل